int Cmp(const void* p1, const void* p2)
{
    return *(int*)p1 - *(int*)p2;
}
void merge(int* nums1, int nums1Size, int m, int* nums2, int nums2Size, int n) {
    int count = 0;
    for (int i = m; i < nums1Size; i++) {
        nums1[i] = nums2[count];
        count++;
    }
    qsort(nums1, m + n, sizeof(int), Cmp);
    return;
}

